Pretty good state transfer in discrete-time quantum walks
نویسندگان
چکیده
Abstract We establish the theory for pretty good state transfer in discrete-time quantum walks. For a class of walks, we show that is characterized by spectrum certain Hermitian adjacency matrix graph; more specifically, vertices involved must be strongly cospectral relative to this matrix, and arccosines its eigenvalues satisfy some number theoretic conditions. Using normalized matrices, cyclic covers, on linear relations between geodetic angles, construct several infinite families walks exhibits phenomenon.
منابع مشابه
Pretty Good State Transfer on Circulant Graphs
Let G be a graph with adjacency matrix A. The transition matrix of G relative to A is defined by H(t) := exp (−itA), where t ∈ R. The graph G is said to admit pretty good state transfer between a pair of vertices u and v if there exists a sequence of real numbers {tk} and a complex number γ of unit modulus such that lim k→∞ H(tk)eu = γev. We find that the cycle Cn as well as its complement Cn a...
متن کاملDiscrete-Time Quantum Walks and Graph Structures
We formulate three current models of discrete-time quantum walks in a combinatorial way. These walks are shown to be closely related to rotation systems and 1-factorizations of graphs. For two of the models, we compute the traces and total entropies of the average mixing matrices for some cubic graphs. The trace captures how likely a quantum walk is to revisit the state it started with, and the...
متن کاملCrossovers induced by discrete-time quantum walks
We consider crossovers with respect to the weak convergence theorems from a discretetime quantum walk (DTQW). We show that a continuous-time quantum walk (CTQW) and discreteand continuous-time random walks can be expressed as DTQWs in some limits. At first we generalize our previous study [Phys. Rev. A 81, 062129 (2010)] on the DTQW with position measurements. We show that the position measurem...
متن کاملScattering theory and discrete-time quantum walks
We study quantum walks on general graphs from the point of view of scattering theory. For a general finite graph we choose two vertices and attach one half line to each, and consider walks that proceed from one half line, through the graph, to the other. The probability of starting on one line and reaching the other after n steps can be expressed in terms of the transmission amplitude for the g...
متن کاملPerfect state transfer in quantum walks on graphs
We provide a brief survey of perfect state transfer in quantum walks on finite graphs. The ability to transfer a quantum state from one part of a quantum computer to another is a key ingredient of scalable architectures. Transfer through structures that do not require locally varying dynamic control simplifies the design and hence reduces the opportunities for errors to arise. Continuous time w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics A
سال: 2023
ISSN: ['1751-8113', '1751-8121']
DOI: https://doi.org/10.1088/1751-8121/acc4f5